The magic of logical inference in probabilistic programming
نویسندگان
چکیده
منابع مشابه
The magic of logical inference in probabilistic programming
Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these methods are typically computationally efficient, they often can neither handle infinite and/or continuous distributions, nor evidence. To overcome these limi...
متن کاملThe PITA System for Logical-Probabilistic Inference
Probabilistic Inductive Logic Programming (PILP) is gaining interest due to its ability to model domains with complex and uncertain relations among entities. Since PILP systems generally must solve a large number of inference problems in order to perform learning, they rely critically on the support of efficient inference systems. PITA [7] is a system for reasoning under uncertainty on logic pr...
متن کاملProbabilistic Logical Inference on the Web
cplint on SWISH is a web application for probabilistic logic programming. It allows users to perform inference and learning using just a web browser, with the computation performed on the server. In this paper we report on recent advances in the system, namely the inclusion of algorithms for computing conditional probabilities with exact, rejection sampling and Metropolis-Hasting methods. Moreo...
متن کاملExploiting Logical Structure in Lifted Probabilistic Inference
Representations that combine first-order logic and probability have been the focus of much recent research. Lifted inference algorithms for them avoid grounding out the domain, bringing benefits analogous to those of resolution theorem proving in first-order logic. However, all lifted probabilistic inference algorithms to date treat potentials as black boxes, and do not take advantage of their ...
متن کاملTitle:clipp: Combining Logical Inference and Probabilistic Planning
Planning on mobile robots deployed in complex real-world application domains is a challenge because: (a) robots lack knowledge representation and common sense reasoning capabilities; and (b) observations from sensors are unreliable and actions performed by robots are non-deterministic. In this talk, I shall describe a hybrid framework named CLIPP that combines answer set programming (ASP) and h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2011
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068411000238